95 research outputs found
Visualization of Skewed Data: A Tool in R
In this work we present a visualization tool specifically tailored to deal
with skewed data. The technique is based upon the use of two types of notched
boxplots (the usual one, and one which is tuned for the skewness of the data),
the violin plot, the histogram and a nonparametric estimate of the density. The
data is assumed to lie on the same line, so the plots are compatible. We show
that a good deal of information can be extracted from the inspection of this
tool; in particular, we apply the technique to analyze data from synthetic
aperture radar images. We provide the implementation in R.Comment: Submitted to the Revista Colombiana de Estad\'istic
Classification and Verification of Online Handwritten Signatures with Time Causal Information Theory Quantifiers
We present a new approach for online handwritten signature classification and
verification based on descriptors stemming from Information Theory. The
proposal uses the Shannon Entropy, the Statistical Complexity, and the Fisher
Information evaluated over the Bandt and Pompe symbolization of the horizontal
and vertical coordinates of signatures. These six features are easy and fast to
compute, and they are the input to an One-Class Support Vector Machine
classifier. The results produced surpass state-of-the-art techniques that
employ higher-dimensional feature spaces which often require specialized
software and hardware. We assess the consistency of our proposal with respect
to the size of the training sample, and we also use it to classify the
signatures into meaningful groups.Comment: Submitted to PLOS On
Distinguishing noise from chaos: objective versus subjective criteria using Horizontal Visibility Graph
A recently proposed methodology called the Horizontal Visibility Graph (HVG)
[Luque {\it et al.}, Phys. Rev. E., 80, 046103 (2009)] that constitutes a
geometrical simplification of the well known Visibility Graph algorithm [Lacasa
{\it et al.\/}, Proc. Natl. Sci. U.S.A. 105, 4972 (2008)], has been used to
study the distinction between deterministic and stochastic components in time
series [L. Lacasa and R. Toral, Phys. Rev. E., 82, 036120 (2010)].
Specifically, the authors propose that the node degree distribution of these
processes follows an exponential functional of the form , in which is the node degree and is a
positive parameter able to distinguish between deterministic (chaotic) and
stochastic (uncorrelated and correlated) dynamics. In this work, we investigate
the characteristics of the node degree distributions constructed by using HVG,
for time series corresponding to chaotic maps and different stochastic
processes. We thoroughly study the methodology proposed by Lacasa and Toral
finding several cases for which their hypothesis is not valid. We propose a
methodology that uses the HVG together with Information Theory quantifiers. An
extensive and careful analysis of the node degree distributions obtained by
applying HVG allow us to conclude that the Fisher-Shannon information plane is
a remarkable tool able to graphically represent the different nature,
deterministic or stochastic, of the systems under study.Comment: Submitted to PLOS On
Structural Changes in Data Communication in Wireless Sensor Networks
Wireless sensor networks are an important technology for making distributed
autonomous measures in hostile or inaccessible environments. Among the
challenges they pose, the way data travel among them is a relevant issue since
their structure is quite dynamic. The operational topology of such devices can
often be described by complex networks. In this work, we assess the variation
of measures commonly employed in the complex networks literature applied to
wireless sensor networks. Four data communication strategies were considered:
geometric, random, small-world, and scale-free models, along with the shortest
path length measure. The sensitivity of this measure was analyzed with respect
to the following perturbations: insertion and removal of nodes in the geometric
strategy; and insertion, removal and rewiring of links in the other models. The
assessment was performed using the normalized Kullback-Leibler divergence and
Hellinger distance quantifiers, both deriving from the Information Theory
framework. The results reveal that the shortest path length is sensitive to
perturbations.Comment: 12 pages, 4 figures, Central European Journal of Physic
Dual views of the generalized degree of purity
Several approaches and descriptors have been proposed to characterize the purity of coherency or density matrices describing physical states, including the polarimetric purity of 2D and 3D partially polarized waves. This work introduces two interpretations of the degree of purity: one derived from statistics and another from algebra. In the first one, the degree purity is expressed in terms of the mean and standard deviation of the eigenvalue spectrum of the density or coherency matrix of the corresponding state. The second one expresses the purity in terms of two specific measures obtained by decomposing the coherency matrix as a sum of traceless symmetric, antisymmetric, and scalar matrices. We believe these two approaches offer better insights into the purity measure. Furthermore, interesting relations with existing quantities in polarization optics also are described
Characterization of Vehicle Behavior with Information Theory
This work proposes the use of Information Theory for the characterization of
vehicles behavior through their velocities. Three public data sets were used:
i.Mobile Century data set collected on Highway I-880, near Union City,
California; ii.Borl\"ange GPS data set collected in the Swedish city of
Borl\"ange; and iii.Beijing taxicabs data set collected in Beijing, China,
where each vehicle speed is stored as a time series. The Bandt-Pompe
methodology combined with the Complexity-Entropy plane were used to identify
different regimes and behaviors. The global velocity is compatible with a
correlated noise with f^{-k} Power Spectrum with k >= 0. With this we identify
traffic behaviors as, for instance, random velocities (k aprox. 0) when there
is congestion, and more correlated velocities (k aprox. 3) in the presence of
free traffic flow
- âŠ